Multitask Emergency Logistics Planning under Multimodal Transportation

Multitask emergency logistics planning is a complex optimization problem in practice. When disaster occurs, relief materials or rescue teams should be dispatched to destinations as soon possible. In nutshell, the can described an of multipoint-to-multipoint transportation delivery given multimodal traffic network. this study, network considered for planning, and mixed-integer programming (MIP) formulation proposed model problem. order solve model, we propose two-layer solution method. The inner layer manage single-task route recommendation, which develop shortest-path algorithm with Here, optimal substructure its time complexity are presented. With each task calculated by solver, general based on improved particle swarm (PSO) at outer coordinate execution constrained limited capacity, so derive solutions multi-commodity planning. Extensive computational results show that method find good quality reasonable time. Meanwhile, through sensitivity analysis algorithm, appropriate parameters paper. approach effective practical solving multitask under transportation, satisfactory acceptable